Di usion Approximations for Re - Entrant Lines with aFirst - Bu er - First - Served Priority
نویسندگان
چکیده
The diiusion approximation is proved for a class of queueing networks, known as re-entrant lines, under a rst-buuer-rst-served (FBFS) service discipline. The diiusion limit for the workload process is a semi-martingale reeecting Brownian motion on a nonnegative orthant. This approximation has recently been used by Dai, Yeh and Zhou (1994) in estimating the performance measures of the re-entrant lines with a FBFS discipline.
منابع مشابه
Mean value analysis of re-entrant line with batch machines and multi-class jobs
We propose an approximate approach for estimating the performance measures of the re-entrant line with single-jobmachines and batch machines based on the mean value analysis (MVA) technique.Multi-class jobs are assumed to be processed in predetermined routings, in which some processes may utilize the same machines in the re-entrant fashion. The performance measures of interest are the steady-st...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملThe QNET Method for Re-Entrant Queueing Networks with Priority Disciplines
This paper is concerned with the estimation of performance measures of two priority disciplines in a d-station re-entrant queueing network. Such networks arise from complex manufacturing systems such as wafer fabrication facilities. The priority disciplines considered are First-Buffer-First-Served (FBFS) and Last-Buffer-First-Served (LBFS). An analytical method is developed to estimate the long...
متن کاملA simple proof of diffusion approximations for LBFS re-entrant lines
For a re-entrant line operating under the last-buffer–first-serve service policy, there have been two independent proofs of a heavy traffic limit theorem. The key to these proofs is to prove the uniform convergence of a critical fluid model. We give a new proof for the uniform convergence of the fluid model.
متن کاملConservation Relations for Fully Shared ATM Bu ers
In ATM networks, bu ering is required to reduce cell loss and increase bandwidth utilization by the bursty tra c. Several types of tra c with di erent performance requirements on delay and loss will share bu er resources. We focus on the fully shared bu er with push-out and a randomized service priority rule. Some conservation relations are obtained which can be used to tune the parameters of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007